Tree Transformations and Dependencies
نویسنده
چکیده
Several tree transformation devices that are relevant in natural language processing are presented with a focus on the dependencies that they are able to capture. In many cases, the consideration of the dependencies alone can be used to provide a high-level explanation of the short-comings of tree transformation devices and allows surprising insights into their structure.
منابع مشابه
Does Universal Dependencies need a parsing representation? An investigation of English
This paper investigates the potential of defining a parsing representation for English data in Universal Dependencies, a crosslingual dependency scheme. We investigate structural transformations that change the choices of headedness in the dependency tree. The transformations make auxiliaries, copulas, subordinating conjunctions and prepositions heads, while in UD they are dependents of a lexic...
متن کاملGeneralizing Tree Transformations for Inductive Dependency Parsing
Previous studies in data-driven dependency parsing have shown that tree transformations can improve parsing accuracy for specific parsers and data sets. We investigate to what extent this can be generalized across languages/treebanks and parsers, focusing on pseudo-projective parsing, as a way of capturing non-projective dependencies, and transformations used to facilitate parsing of coordinate...
متن کاملGrammar Transformations in an EDA for Genetic Programming
In this paper we present a new Estimation–of–Distribution Algorithm (EDA) for Genetic Programming (GP). We propose a probability distribution for the space of trees, based on a grammar. To introduce dependencies into the distribution, grammar transformations are performed that facilitate the description of specific subfunctions. We present some results from experiments on two benchmark problems...
متن کاملContribution toTemporal Fault Tree Analysiswithout Modularization and Transformation into the State SpaceOriginal german title:Beitrag zur dynamischen Fehlerbaumanalyse ohne Modulbildungund zustandsbasierte Erweiterungen
Background Fault tree analysis (FTA) is a well established method for qualitative as well as probabilistic reliability and safety analysis. Fault trees are Boolean models and thus do not support modelling of dynamic effects like sequence dependencies between fault events. In order to overcome this limitations, dynamic fault tree methods were defined previously. Most of these are based on comple...
متن کاملFinding Minimum Cost Spanning Tree on Bidirectional Linear Systolic Array∗
In this paper a bidirectional linear systolic array (BLSA) that computes minimum cost spanning tree (MCST) of a given graph is designed. We present a synthesis procedure, based on data dependencies and space-time transformations of index space, to design BLSA with optimal number of processing elements (PEs) for a given problem size. The execution time is minimized for that number of PEs. Explic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011